Complexity One Hamiltonian
ثبت نشده
چکیده
We consider compact connected six dimensional symplectic mani-folds with Hamiltonian SU(2) or SO(3) actions with cyclic principal stabilizers. We classify such manifolds up to equivariant symplectomorphisms.
منابع مشابه
Adiabatic Quantum Computing: An Overview
Quantum computations can be implemented not only by the action of quantum circuits, but by the adiabatic evolution of a system’s Hamiltonian. This can be done by initializing the system into the ground state of a simple Hamiltonian, and then adiabatically evolving the Hamiltonian to one whose ground state encodes the solution to the problem. The time complexity of the problem, or more basically...
متن کاملOn the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP -hard in general, and no polynomial time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the complexity of approximating this problem where by a feasible solution we mean a(nother) cycle in t...
متن کاملHamiltonian Cycle Problem for Triangle Graphs
We show that the Hamiltonian cycle problem is NP-complete for a class of planar graphs named triangle graphs that are closely related to inner-triangulated graphs. We present a linear-time heuristic algorithm that nds a solution at most one-third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics.
متن کاملHamiltonian simulation with complexity polylogarithmic in the error
Quantum algorithms for the simulation of quantum systems described by a Hamiltonian provide an exponential improvement in speed over classical algorithms when one considers scaling of the complexity in terms of the dimension. However, one key drawback is that the scaling in terms of the allowable error, ε, is relatively poor. Here we provide a new quantum algorithm whose scaling with respect to...
متن کاملA linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
The Hamiltonian cycle problem is one of the most popular NP-complete problems, and remains NP-complete even if we restrict ourselves to a class of (3-connected cubic) planar graphs [5,9]. Therefore, there seems to be no polynomial-time algorithm for the Hamiltonian cycle problem. However, for certain (nontrivial) classes of restricted graphs, there exist polynomial-time algorithms [3,4,6]. In f...
متن کاملAnomalous fluctuations for a perturbed hamiltonian system with exponential interactions
A one-dimensional Hamiltonian system with exponential interactions perturbed by a conservative noise is considered. It is proved that energy superdiffuses and upper and lower bounds describing this anomalous diffusion are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003